Reliability of interconnection networks modeled by Cartesian product digraphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliability of interconnection networks modeled by Cartesian product digraphs

We determine that the connectivity and the edgeconnectivity of the Cartesian product G1 × G2 of two strongly connected and finite digraphs G1 and G2 are equal to min{n1κ2,n2κ1, δ+ 1 + δ+ 2 , δ− 1 + δ− 2 } and min{n1λ2,n2λ1, δ+ 1 + δ+ 2 , δ− 1 + δ− 2 }, respectively, where ni , κi , λi , δ + i , δ − i are the order, the connectivity, the edgeconnectivity, the minimum out-degree and the minimum i...

متن کامل

The reliability Wiener number of cartesian product graphs

Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

متن کامل

Multistage Interconnection Networks Reliability

Reliability and performance of interconnection network systems significantly depends on the interconnection of its components, among other factors. The interconnection among switches, number of stages, and the types of switches normally determine the system configuration. System performance could be analyzed based on its redundant paths, information transition time, and its reliability. As the ...

متن کامل

Wide Diameters of Cartesian Product Graphs and Digraphs

In graph theory and study of fault tolerance and transmission delay of networks, connectivity and diameter of a graph are two very important parameters and have been deeply studied by many authors. Wide diameter combining connectivity with diameter is a more important parameter to measure fault tolerance and efficiency of parallel processing computer networks and has received much attention in ...

متن کامل

Bipanconnectivity of Cartesian product networks

This paper is concerned with the bipanconnectivity of Cartesian product networks. It provides sufficient conditions for a Cartesian product network to be bipanconnected and uses this general result to re-prove existing results as regards the k-ary n-cube, due to Stewart and Xiang and to Hsieh and Lin, as well as to extend these results to multidimensional toroidal meshes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Networks

سال: 2008

ISSN: 0028-3045,1097-0037

DOI: 10.1002/net.20231